SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS
نویسندگان
چکیده
منابع مشابه
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used as “subroutines” for other combinatorial optimization problems. In the sub-coloring problem, given a graph G, we want to partition the vertices of G into minimum number of sub-color classes, where each sub-color clas...
متن کاملColoring Fuzzy Circular Interval Graphs
Given a graph G with nonnegative node labels w, a multiset of stable sets S1, . . . , Sk ⊆ V (G) such that each vertex v ∈ V (G) is contained in w(v) many of these stable sets is called a weighted coloring. The weighted coloring number χw(G) is the smallest k such that there exist stable sets as above. We provide a polynomial time combinatorial algorithm that computes the weighted coloring numb...
متن کاملOnline Coloring Co-interval Graphs
We study the problem of online coloring co-interval graphs. In this problem, a set of intervals on the real line is presented to the online algorithm in some arbitrary order, and the algorithm must assign each interval a color that is different from the colors of all previously presented intervals not intersecting the current interval. It is known that the competitive ratio of the simple First-...
متن کاملEdge and total coloring of interval graphs
An edge coloring of a graph is a function assigning colors to edges so that incident edges acquire distinct colors. The least number of colors su'cient for an edge coloring of a graph G is called its chromatic index and denoted by ′(G). Let (G) be the maximal degree of G; if ′(G) = (G), then G is said to belong to class 1, and otherwise G is said to belong to class 2. A total coloring of a grap...
متن کامل)-Coloring of Trees and Interval Graphs
Given a vector (δ1, δ2, . . . , δt ) of nonincreasing positive integers, and an undirected graph G = (V ,E ), an L(δ1, δ2, . . . , δt )-coloring of G is a function f from the vertex set V to a set of nonnegative integers such that |f (u)− f (v )| ≥ δi , if d (u,v ) = i , 1 ≤ i ≤ t , where d (u,v ) is the distance (i.e., the minimum number of edges) between the vertices u and v . An optimal L(δ1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics, Algorithms and Applications
سال: 2010
ISSN: 1793-8309,1793-8317
DOI: 10.1142/s1793830910000693